An Inequality concerning Polyhedra

نویسنده

  • LASZLÓ FEJES TÓTH
چکیده

This is easily established, since according to the theorem of Euler mentioned above, if d denotes the distance between the centers of the circumscribed and inscribed circles, then d = R2rR. It follows that R~2rR^0, and therefore R^2r. Equality holds only if the two circles are concentric, that is, if the triangle is equilateral. The problem of generalizing the above result to space was proposed by Professor L. Fejér. A young mathematician, I. Âdâm, deported to Germany during the war—where all traces of him have been lost—found and communicated to Professor Fejér in 1943 a very simple proof of the above extremum property of the equilateral triangle. His proof, which may be immediately generalized to space, runs as follows: If p is the radius of the circle passing through the midpoints of the sides of the triangle, then p = i?/2, and all that need be shown is that p is at least equal to the radius of the inscribed circle. This follows from the fact that the inscribed circle is the smallest among all circles which have common points with all three sides of the triangle. Such a circle is, namely, the circle inscribed in a homothetic triangle containing the original one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Encoding and Implementation of Not Necessarily Closed Convex Polyhedra

Convex polyhedra, commonly employed for the analysis and verification of both hardware and software, may be defined either by a finite set of linear inequality constraints or by finite sets of generating points and rays of the polyhedron. Although most implementations of the polyhedral operations assume that the polyhedra are topologically closed (i.e., all the constraints defining them are non...

متن کامل

On Canonical Representations of Convex Polyhedra

Every convex polyhedron in the Euclidean space Rd admits both H-representation and V-representation. When working with convex polyhedra, in particular largescale ones in high dimensions, it is useful to have a canonical representation that is minimal and unique up to some elementary operations. Such a representation allows one to compare two H-polyhedra or two V-polyhedra efficiently. In this p...

متن کامل

On the Rank of Disjunctive Cuts

Let L be a family of lattice-free polyhedra in R containing the splits. Given a polyhedron P in R, we characterize when a valid inequality for P ∩(Z×R) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in L. We also characterize the lattice-free polyhedra M such that all the disjunctive cuts corresponding to M can be obtained with a finite number of disjunc...

متن کامل

Speeding up Polyhedral Analysis by Identifying Common Constraints

Sets of linear inequalities are an expressive reasoning tool for approximating the reachable states of a program. However, the most precise way to join two states is to calculate the convex hull of the two polyhedra that are represented by the inequality sets, an operation that is exponential in the dimension of the polyhedra. We investigate how similarities in the two input polyhedra can be ex...

متن کامل

A Local Collision Avoidance Method for Non-strictly Convex Polyhedra

This paper proposes a local collision avoidance method for non-strictly convex polyhedra with continuous velocities. The main contribution of the method is that non-strictly convex polyhedra can be used as geometric models of the robot and the environment without any approximation. The problem of the continuous interaction generation between polyhedra is reduced to the continuous constraints ge...

متن کامل

Interprocedurally Analyzing Linear Inequality Relations

We present an abstraction of the effect of procedures through convex sets of transition matrices. Conditional branching is handled by postponing the conditional evaluation after the procedure call. In order to obtain an effective analysis convex sets are represented by polyhedra. For an efficient implementation we approximate polyhedra by means of simplices. In [CH78], Cousot and Halbwachs pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007